Primitive Zero-Symmetric Sign Pattern Matrices with Zero Diagonal Attaining the Maximum Base
نویسندگان
چکیده
A sign pattern matrix or sign pattern A is a matrix whose entries are from the set {1,−1, 0}. Notice that for a square sign pattern matrixA, in the computation of the signs of the entries of the power A, an ambiguous sign may arise when a positive sign is added to a negative sign. So a new symbol # was introduced in 1 to denote such an ambiguous sign. The powers of a square sign pattern have been investigated to some extent, see, for example, 1–12 . In 1 , the set Γ {1,−1, 0, #} is defined as the generalized sign set and the matrices with entries in the set Γ are called generalized sign pattern matrices, and the addition and multiplication involving the symbol # are defined as follows:
منابع مشابه
Power Indices of Trace Zero Symmetric Boolean Matrices
The power index of a square Boolean matrix A is the least integer d such that A is a linear combination of previous nonnegative powers of A. We determine the maximum power indices for the class of n × n primitive symmetric Boolean matrices of trace zero, the class of n × n irreducible nonprimitive symmetric Boolean matrices, and the class of n×n reducible symmetric Boolean matrices of trace zer...
متن کاملEla Minimum Rank, Maximum Nullity, and Zero Forcing Number of Simple Digraphs
A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not necessarily symmetric) matrices. Minimum rank of a simple digraph is the minimum rank of this family of matrices; maximum nullity is defined analogously. The simple digraph zero forcing number is an upper bound for maximum nullity. Cut-vertex reduction formulas for minimum rank and zero forcing number for simpl...
متن کاملRational realization of maximum eigenvalue multiplicity of symmetric tree sign patterns
Abstract. A sign pattern is a matrix whose entries are elements of {+,−, 0}; it describes the set of real matrices whose entries have the signs in the pattern. A graph (that allows loops but not multiple edges) describes the set of symmetric matrices having a zero-nonzero pattern of entries determined by the absence or presence of edges in the graph. DeAlba et al. [3] gave algorithms for the co...
متن کاملA note on minimum rank and maximum nullity of sign patterns
The minimum rank of a sign pattern matrix is defined to be the smallest possible rank over all real matrices having the given sign pattern. The maximum nullity of a sign pattern is the largest possible nullity over the same set of matrices, and is equal to the number of columns minus the minimum rank of the sign pattern. Definitions of various graph parameters that have been used to bound maxim...
متن کاملEla a Note on Minimum Rank and Maximum Nullity of Sign Patterns
The minimum rank of a sign pattern matrix is defined to be the smallest possible rank over all real matrices having the given sign pattern. The maximum nullity of a sign pattern is the largest possible nullity over the same set of matrices, and is equal to the number of columns minus the minimum rank of the sign pattern. Definitions of various graph parameters that have been used to bound maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Mathematics
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012